Numerical Considerations in Computing Invariant Subspaces
نویسندگان
چکیده
منابع مشابه
Invariant subspaces in Simpira
In this short note we report on invariant subspaces in Simpira in the case of four registers. In particular, we show that the whole input space (respectively output space) can be partitioned into invariant cosets of dimension 56 over F 28 . These invariant subspaces are found by exploiting the non-invariant subspace properties of AES together with the particular choice of Feistel configuration....
متن کاملOn correction equations and domain decomposition for computing invariant subspaces
By considering the eigenvalue problem as a system of nonlinear equations, it is possible to develop a number of solution schemes which are related to the Newton iteration. For example, to compute eigenvalues and eigenvectors of an n · n matrix A, the Davidson and the Jacobi–Davidson techniques, construct ‘good’ basis vectors by approximately solving a ‘‘correction equation’’ which provides a co...
متن کاملA Grassmann-Rayleigh Quotient Iteration for Computing Invariant Subspaces
The classical Rayleigh quotient iteration (RQI) allows one to compute a one-dimensional invariant subspace of a symmetric matrix A. Here we propose a generalization of the RQI which computes a p-dimensional invariant subspace of A. Cubic convergence is preserved and the cost per iteration is low compared to other methods proposed in the literature.
متن کاملOn a Direct Algorithm for Computing Invariant Subspaces With. . .
[13] V. Mehrmann, A Symplectic orthogonal method for single input or single output discrete time optimal control problems, in Linear Algebra in Signals Systems and Control, B. N. Datta et al eds. SIAM Philadelphia, Penn. pp.128-140(1988). [14] K. C. Ng and B. N. Parlett, Development of an accurate algorithm for EXP(Bt), Part I, Programs to swap diagonal block, Part II, CPAM-294, University of C...
متن کاملFast Parallelizable Methods for Computing Invariant Subspaces of Hermitian Matrices
We propose a quadratically convergent algorithm for computing the invariant subspaces of an Hermitian matrix. Each iteration of the algorithm consists of one matrix-matrix multiplication and one QR decomposition. We present an accurate convergence analysis of the algorithm without using the big O notation. We also propose a general framework based on implicit rational transformations which allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1992
ISSN: 0895-4798,1095-7162
DOI: 10.1137/0613013